UCT for Pac-Man
نویسندگان
چکیده
This is the written documentation of the implementation of an agent for Ms-Pac-Man for a Ms. Pac-Man simulation. The agent uses the UCT algorithm (upper confident bounds) which is becoming more prominent in the domain of artificial intelligence research. In this document you will find a description of the UCT algorithm, statements to the implementation and an evaluation of the performance.
منابع مشابه
Clever Pac-man
In this paper we show how combining fuzzy sets and reinforcement learning a winning agent can be created for the popular Pac-man game. Key elements are the classification of the state into a few fuzzy classes that makes the problem manageable. Pac-man policy is defined in terms of fuzzy actions that are defuzzified to produce the actual Pac-man move. A few heuristics allow making the Pac-man st...
متن کاملCI enlivened ghosts for Pac-Man
Pac-Man is a well known classic arcade game, developed by the Japanese company Namco in 1980. In Pac-Man, the player controls a figure called Pac-Man navigating through a maze with the task to eat all dots (called food-pellets) lying in the tunnels of the maze, by which he wins the level and advances to the next. Pac-Man is chased by four computer controlled enemies (ghosts) who eat him if they...
متن کاملEnhancements for Monte-Carlo Tree Search in Ms Pac-Man
In this paper enhancements for the Monte-Carlo Tree Search (MCTS) framework are investigated to play Ms Pac-Man. MCTS is used to find an optimal path for an agent at each turn, determining the move to make based on randomised simulations. Ms Pac-Man is a real-time arcade game, in which the protagonist has several independent goals but no conclusive terminal state. Unlike games such as Chess or ...
متن کاملNORM AND INNER PRODUCT ON FUZZY LINEAR SPACES OVER FUZZY FIELDS
In this paper, we introduce the concepts of norm and inner prod- uct on fuzzy linear spaces over fuzzy elds and discuss some fundamental properties.
متن کاملTowards Practical Theory: Bayesian Optimization and Optimal Exploration
This thesis discusses novel principles to improve the theoretical analyses of a class of methods, aiming to provide theoretically driven yet practically useful methods. The thesis focuses on a class of methods, called bound-based search, which includes several planning algorithms (e.g., the A* algorithm and the UCT algorithm), several optimization methods (e.g., Bayesian optimization and Lipsch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011